The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity

نویسندگان

  • Giuseppe Castagna
  • Francesco Zappa Nardelli
چکیده

We present a new version of the Seal Calculus, a calculus of mobile computation. We study observational congruence and bisimulation theory, and show how they are related.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fully abstract encodings of λ-calculus in HOcore through abstract machines

We present fully abstract encodings of the call-byname λ-calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider several equivalences on the λ-calculus side—normal-form bisimilarity, applicative bisimilarity, and contextual equivalence—that we internalize into abstract machines in order to prove full abstraction.

متن کامل

Normal Form Bisimulations for Delimited-Control Operators

We define a notion of normal form bisimilarity for the untyped call-by-value λ-calculus extended with the delimited-control operators shift and reset. Normal form bisimilarities are simple, easy-to-use behavioral equivalences which relate terms without having to test them within all contexts (like contextual equivalence), or by applying them to function arguments (like applicative bisimilarity)...

متن کامل

Characterizing contextual equivalence in calculi with passivation

We study the problem of characterizing contextual equivalence in higher-orderlanguages with passivation. To overcome the difficulties arising in the proofof congruence of candidate bisimilarities, we introduce a new form of labelledtransition semantics together with its associated notion of bisimulation, whichwe call complementary semantics. Complementary semantics allows to...

متن کامل

Simulation in the Call-by-Need Lambda-Calculus with letrec

This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-need lambda calculus with letrec. Bisimilarity simplifies equivalence proofs in the calculus and opens a way for more convenient correctness proofs for program transformations. Although this property may be a natural one...

متن کامل

Applicative Bisimulations for Delimited-Control Operators

We develop a behavioral theory for the untyped call-by-value λ-calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possible observable behaviors and we define an applicative bisimilarity that characterizes contextual equivalence. We then compare the applicative bisimilarity and the CPS equivalence, a relation on terms often used in studies o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002